Euclidean distance between two linear varieties

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining the Euclidean Distance Between Two Steady State Sounds

We describe a perceptual space for timbre, define an objective metric that takes into account perceptual orthogonality and measure the quality of timbre interpolation. We discuss two timbre representations and using these two representations, measure perceived relationships between pairs of sounds on a equivalent range of timbre variety. We determine that a timbre space based on Mel-frequency c...

متن کامل

Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

A Euclidean distance transform in linear time

A new linear time scanning algorithm for the exact Euclidean distance transform is presented. It is shorter and uses a smaller data structure than the approximating algorithms of Danielsson. The algorithm consists of two phases. The rst phase uses two scans per line to compute the distance transform over the columns of the image. Then the second phase uses two scans per row. Informally speaking...

متن کامل

The Euclidean Distance Degree of Smooth Complex Projective Varieties

We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely simple formula equating the Euclidean distance degree of X with the Euler characteristic of an open subset of X.

متن کامل

Linear Time Euclidean Distance Transform Algorithms

Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented. The algorithms are based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit (feature) pixels in the image. The rst algorithm, which is of primarily theoretical interest, constructs the complete ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematical Sciences

سال: 2014

ISSN: 1314-7552

DOI: 10.12988/ams.2014.311656